Robust and Stable Flow Shop Scheduling Problem under Uncertain Processing Times and Machines’ Disruption

This paper presents a predictive robust and stable approach for two-machine flow shop scheduling problem with machine disruption uncertain job processing time. Indeed, general is proposed that can be used robustness stability optimization in an m-machine or problem. The measure the total expected realized completion sum of squared aberration between each jobs’ time initial schedules measure. We compared two methods to deal such NP-hard problem; method based on decomposing into sub-problem solving sub-problem, theorem-based method. extensive computational results indicated second has better performance terms stability, especially large-sized problems. In other words, preferable because manufacturer responsiveness customer production staff satisfaction enhancement.